CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape
نویسندگان
چکیده
منابع مشابه
Between Subgraph Isomorphism and Maximum Common Subgraph
When a small pattern graph does not occur inside a larger target graph, we can ask how to find “as much of the pattern as possible” inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism. We introduce a restricted alternative, where we ask if all but k vertices from the patte...
متن کاملCP Models for Maximum Common Subgraph Problems
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, or a partial subgraph, obtained by removing arcs and nodes. In this paper, we introduce two soft CSPs which model these two maximum common subgraph problems in a unified framework. We also introduce and compare differe...
متن کاملA Partitioning Algorithm for Maximum Common Subgraph Problems
We introduce a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning. Our method in some ways resembles a traditional constraint programming approach, but uses a novel compact domain store and supporting inference algorithms which dramatically reduce the memory and computation require...
متن کاملAn Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs
We propose a new fast algorithm for solving the Maximum Common Subgraph (MCS) problem. MCS is an NP-complete problem. In this paper, we focus on a special class of graphs, i.e. Planar Triangulation Graphs, which are commonly used in computer vision, pattern recognition and graphics. By exploiting the properties of Planar Triangulation Graphs and restricting the problem to connected MCS, for two...
متن کاملFacets for the Maximum Common Induced Subgraph Problem Polytope
This paper presents some strong valid inequalities for the Maximum Common Induced Subgraph Problem (MCIS) and the proofs that the inequalities are facet-defining under certain conditions. TheMCIS is an NP-hard problem and, therefore, no polynomial time algorithm is known to solve it. In this context, the study of its polytope can help in the development of more efficient branch-and-bound and br...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Integrative Bioinformatics
سال: 2017
ISSN: 1613-4516
DOI: 10.1515/jib-2017-0014